Quadrangular with the maximal area

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Maximal Area Sets and Harmony

A musical scale can be viewed as a subset of notes or pitches taken from a chromatic universe. For the purposes of this paper we consider a chromatic universe of twelve equally spaced pitches. Given integers (N,K) with N > K we use particular integer partitions of N into K parts to construct distinguished sets, or scales. We show that a natural geometric realization of these sets have maximal a...

متن کامل

Quadrangular algebras , by Richard

One of the best-known and most beautiful parts of mathematics is the classification of the simple Lie groups over the complex numbers. This was achieved in the late 1880s by Wilhelm Killing, whose work was remodelled by Élie Cartan in 1894, and it is now referred to as the Killing-Cartan classification. A Lie group is called simple if it has no non-trivial, connected, normal subgroups, and the ...

متن کامل

Quadrangular Resection of the Tricuspid Valve

Quadrangular resection is the gold standard technique for correction of the posterior leaflet prolapse in mitral valve disease. Prompted by the idea that the anterior leaflet of the tricuspid valve corresponds to the posterior leaflet of the mitral valve in its structure and function, we conducted a quadrangular resection of the anterior leaflet of the tricuspid valve in a case of tricuspid end...

متن کامل

Maximal Area Triangles in a Convex Polygon

In [12], the widely known linear time algorithm for computing the maximum area triangle in a convex polygon was found incorrect, and whether it can still be solved in linear time was proposed as an open problem. We resolved it affirmatively by presenting a new linear time algorithm. Our algorithm is simple and easy to implement, and it computes all the locally maximal triangles. 1998 ACM Subjec...

متن کامل

Quadrangular embeddings of complete graphs∗

Hartsfield and Ringel proved that a complete graph Kn has an orientable quadrangular embedding if n ≡ 5 (mod 8), and has a nonorientable quadrangular embedding if n ≥ 9 and n ≡ 1 (mod 4). We complete the characterization of complete graphs admitting quadrangular embeddings by showing that Kn has an orientable quadrilateral embedding if n ≡ 0 (mod 8), and has a nonorientable quadrilateral embedd...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Časopis pro pěstování matematiky a fysiky

سال: 1903

ISSN: 1802-114X

DOI: 10.21136/cpmf.1903.109057